Size Nodes Visited Time Set
نویسندگان
چکیده
In Image Database Systems, symbolic pictures are represented by 2D stringsthat are converted into triples. Each triple is mapped to a unique hash addressfor timely retrieval of pictures, reducing the pattern-matching problem cor-responding to a query to that of computation of hash function. The valuesassociated with the picture objects are used to compute hash addresses fortriples developed from the query. In this paper, we propose heuristics to speedup the computation of the associated values for the picture objects. Exper-imental results show that the new algorithm achieves almost a 90% gain, insearch space, over existing algorithm to compute the associated values.
منابع مشابه
Relational Approach for Shortest Path Discovery over Large Graphs
With the rapid growth of large graphs, we cannot assume that graphs can still be fully loaded into memory, thus the disk-based graph operation is inevitable. In this paper, we take the shortest path discovery as an example to investigate the technique issues when leveraging existing infrastructure of relational database (RDB) in the graph data management. Based on the observation that a variety...
متن کاملHardness Results on Curve/Point Set Matching with Fréchet Distance
Let P be a polygonal curve in R of length n, and S be a point-set of size k. We consider the problem of finding a polygonal curve Q on S such that all points in S are visited and the Fréchet distance from P is less than a given ε. We show that this problem is NP-complete, regardless of whether or not points from S are allowed be visited more than once. However, we also show that if the problem ...
متن کاملOptimizing the Event-based Method of Localization in Wireless Sensor Networks
A Wireless Sensor Network (WSN) is a wireless decentralized structure network consists of many nodes. Nodes can be fixed or mobile. WSN applications typically observe some physical phenomenon through sampling of the environment so determine the location of events is an important issue in WSN. Wireless Localization used to determine the position of nodes. The precise localization in WSNs is a co...
متن کاملHow Many Nodes are Effectively Accessed in Complex Networks?
The measurement called accessibility has been proposed as a means to quantify the efficiency of the communication between nodes in complex networks. This article reports important results regarding the properties of the accessibility, including its relationship with the average minimal time to visit all nodes reachable after h steps along a random walk starting from a source, as well as the num...
متن کاملCommunity Detection using a New Node Scoring and Synchronous Label Updating of Boundary Nodes in Social Networks
Community structure is vital to discover the important structures and potential property of complex networks. In recent years, the increasing quality of local community detection approaches has become a hot spot in the study of complex network due to the advantages of linear time complexity and applicable for large-scale networks. However, there are many shortcomings in these methods such as in...
متن کامل